- equational theory
- мат.эквациональная теория
English-Russian scientific dictionary. 2008.
equational theory
Смотреть что такое "equational theory" в других словарях:
Equational box — Equation E*qua tion, n. [L. aequatio an equalizing: cf. F. [ e]quation equation. See {Equate}.] 1. A making equal; equal division; equality; equilibrium. [1913 Webster] Again the golden day resumed its right, And ruled in just equation with the… … The Collaborative International Dictionary of English
Theory of equations — Equation E*qua tion, n. [L. aequatio an equalizing: cf. F. [ e]quation equation. See {Equate}.] 1. A making equal; equal division; equality; equilibrium. [1913 Webster] Again the golden day resumed its right, And ruled in just equation with the… … The Collaborative International Dictionary of English
Model theory — This article is about the mathematical discipline. For the informal notion in other parts of mathematics and science, see Mathematical model. In mathematics, model theory is the study of (classes of) mathematical structures (e.g. groups, fields,… … Wikipedia
Boolean algebras canonically defined — Boolean algebras have been formally defined variously as a kind of lattice and as a kind of ring. This article presents them more neutrally but equally formally as simply the models of the equational theory of two values, and observes the… … Wikipedia
Action algebra — In algebraic logic, an action algebra is an algebraic structure which is both a residuated semilattice and a Kleene algebra. It adds the star or reflexive transitive closure operation of the latter to the former, while adding the left and right… … Wikipedia
Unification (computer science) — Unification, in computer science and logic, is an algorithmic process by which one attempts to solve the satisfiability problem. The goal of unification is to find a substitution which demonstrates that two seemingly different terms are in fact… … Wikipedia
Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… … Wikipedia
Curry–Howard correspondence — A proof written as a functional program: the proof of commutativity of addition on natural numbers in the proof assistant Coq. nat ind stands for mathematical induction, eq ind for substitution of equals and f equal for taking the same function… … Wikipedia
F-coalgebra — In mathematics, specifically in category theory, an F coalgebra is a structure defined according to a functor F. For both algebra and coalgebra, a functor is a convenient and general way of organizing a signature. This has applications in… … Wikipedia
Fexpr — In Lisp programming languages, a fexpr is a function whose operands are passed to it without being evaluated. When a fexpr is called, only the body of the fexpr is evaluated; no other evaluations take place except when explicitly initiated by the … Wikipedia
Cartesian closed category — In category theory, a category is cartesian closed if, roughly speaking, any morphism defined on a product of two objects can be naturally identified with a morphism defined on one of the factors. These categories are particularly important in… … Wikipedia
